Connections between labellings of trees

Authors

  • B. Yao College of Mathematics and Statistics‎, ‎Northwest‎ ‎Normal University‎, ‎Lanzhou‎, ‎730070‎, ‎China.
  • M. Yao Department of Information Process and Control Engineering‎, ‎Lanzhou Petrochemical College of Vocational Technology‎, ‎Lanzhou‎, ‎730060‎, ‎China.
  • X. Liu School of Mathematics and Statistics‎, ‎Beijing Institute of Techology‎, ‎Beijing 100081‎, ‎China.
Abstract:

There are many long-standing conjectures related with some labellings of trees. It is important to connect labellings that are related with conjectures. We find some connections between known labellings of simple graphs.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

connections between labellings of trees

there are many long-standing conjectures related with some labellings of trees. it is important to connect labellings that are related with conjectures. we find some connections between known labellings of simple graphs.

full text

Relaxed Graceful Labellings of Trees

A graph G on m edges is considered graceful if there is a labelling f of the vertices of G with distinct integers in the set {0, 1, . . . ,m} such that the induced edge labelling g defined by g(uv) = |f(u) − f(v)| is a bijection to {1, . . . ,m}. We here consider some relaxations of these conditions as applied to tree labellings: 1. Edge-relaxed graceful labellings, in which repeated edge label...

full text

Modular gracious labellings of trees

A gracious labelling g of a tree is a graceful labelling in which, treating the tree as a bipartite graph, the label of any edge (d,u) (d a ‘down’ and u an ‘up’ vertex) is g(u) – g(d). A gracious k-labelling is one such that each residue class modulo k has the ‘correct’ numbers of vertex and edge labels that is, the numbers that arise by interpreting the labels of a gracious labelling modulo k....

full text

Constructing Trees with Graceful Labellings Using Caterpillars

Hrnciar and Haviar [3] gave a method to a construct a graceful labeling for all trees of diameter at most five. Based on their method and the methods described in Balbuena et al [1], we shall describe a new construction for gracefully labeled trees by attaching trees to the vertices of a tree admitting a bipartite graceful labeling.

full text

Graceful and harmonious labellings of trees

We establish that all trees on at most 27 vertices admit graceful labellings and all trees on at most 26 vertices admit harmonious labellings. A graceful labelling of a graph G with q edges is an injection f : V (G) → {0, 1, 2, . . . , q} such that when each edge xy ∈ E(G) is assigned the label, |f(x) − f(y)|, all of the edge labels are distinct. A graph which admits a graceful labelling is sai...

full text

Optimal radio labellings of complete m-ary trees

In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier's archiving and manuscript policies are encouraged to visit: Keywords: Channel assignment Radio labelling Radio number m-ary tree Binary tree a b s t r a c t A radio labelling of a conn...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 43  issue 2

pages  275- 283

publication date 2017-04-01

{@ msg @}

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023